<!DOCTYPE html>
<html>

<head>
<meta charset="UTF-8">

<title> 提交记录 9080 - Judge Duck Online </title>

<link rel="icon" type="image/png" href="/images/judgeduck-logo-small.png" />

<script src="/libs/js/jquery-3.2.1.min.js"></script>

<!-- Latest compiled and minified CSS -->
<link rel="stylesheet" href="/libs/css/bootstrap.min.css" />

<!-- Latest compiled and minified JavaScript -->
<script src="/libs/js/bootstrap.min.js"></script>

<link rel="stylesheet" type="text/css" href="/css/main.css" />
<link rel="stylesheet" href="/css/non-responsive.css" type="text/css" />

<script src="/js/md5.js"></script>
<script src="/js/judgeduck.js"></script>

<script type="text/x-mathjax-config">
	MathJax.Hub.Config({
		showProcessingMessages: false,
		tex2jax: {
			inlineMath: [["$", "$"], ["\\\\(", "\\\\)"]],
			processEscapes:true
		},
		menuSettings: {
			zoom: "Hover"
		}
	});
</script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.css">
<script src="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.js"></script>

</head>

<body onload="">

<!-- Fixed navbar -->
<nav class="navbar navbar-default" role="navigation" style="background-color: #eeeeee">
	<div class="container">
		<div class="navbar-header">
			<div class="navbar-brand">
				<a href="/">
					<img src="/images/judgeduck-logo.png" width="40px" height="40px" style="margin:-10px" />
				</a>
			</div>
			<font class="navbar-brand">
				Judge Duck Online
			</font>
		</div>
		<div class="navbar-collapse collapse">
			<ul class="nav navbar-nav">
				<li class="nav-item">
					<a class="nav-link" href="/index/index.html"> 首页 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/problems/index.html"> 题目列表 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/submissions/index.html"> 提交记录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/blogs/index.html"> 博客 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/faq/index.html"> FAQ </a>
				</li>
			</ul>
			<ul class="nav navbar-nav navbar-right">
				<li class="nav-item">
					<a class="nav-link" href="/user/login/index.html"> 登录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/user/register/index.html"> 注册 </a>
				</li>
			</ul>
		</div><!--/.nav-collapse -->
	</div>
</nav>




<div id="main_div" class="container" style="padding-left: 25px; padding-right: 25px">
	<h2> 提交记录 9080 </h2>
	<hr />
	
	<div class="row">
		<div class="col-xs-12">
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-2"> 用户 </th>
					<th class="col-xs-3"> 题目 </th>
					<th class="col-xs-2"> 状态 </th>
					<th class="col-xs-1"> 得分 </th>
					<th class="col-xs-1"> 用时 </th>
					<th class="col-xs-1"> 内存 </th>
					<th class="col-xs-1"> 语言 </th>
					<th class="col-xs-1"> 代码长度 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> <a href='/user/profile/__test_sais_lite/index.html'> __test_sais_lite </a> </td>
<td> <a href='/problem/1006/index.html'> 1006. 【模板题】后缀排序 </a> </td>
<td> Accepted </td>
<td> 100 </td>
<td style='font-size:13px'> 10.539 ms </td>
<td style='font-size:13px'> 3 MB + 928 KB </td>
<td style='font-size:13px'> C </td>
<td style='font-size:13px'> 10.72 KB </td>
				</tr>
			</table>
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-6"> 提交时间 </th>
					<th class="col-xs-6"> 评测时间 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> 2019-04-10 08:15:51 </td>
<td style='font-size:13px'> 2019-04-10 08:16:05 </td>
				</tr>
			</table>
			<link rel="stylesheet" href="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/styles/tomorrow.min.css">
			<script src="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/highlight.min.js"></script>
			<script>hljs.initHighlightingOnLoad();</script>
			<div class="row">
				<label for="code"> 代码 </label>
				<pre style="background-color:white"><code class="cpp">
/*****************************************************************************/

#define _M_Size (1 &lt;&lt; 24)
char _M[_M_Size];
char* _M_pos = _M + _M_Size;

/* sais.c for sais-lite (edited) *********************************************/

#define elsif else if

#ifndef MINBUCKETSIZE
# define MINBUCKETSIZE 256
#endif

#define sais_index_type int
#define sais_bool_type  int
#define SAIS_LMSSORT2_LIMIT 0x3fffffff

#define sais_malloc(_num, _type) (_type *)(_M_pos -= ((_num) * sizeof(_type)))

/* find the start or end of each bucket */
inline void getCounts(sais_index_type T[], sais_index_type C[], sais_index_type n, sais_index_type k)
{
	sais_index_type i;
	for (i = 0; i &lt; k; ++i)
		C[i] = 0;
	for (i = 0; i &lt; n; ++i)
		++C[T[i]];
}

inline void getBuckets(sais_index_type C[], sais_index_type B[], sais_index_type k, sais_bool_type end)
{
	sais_index_type i, sum = 0;
	if (end)
		for (i = 0; i &lt; k; ++i)
			B[i] = sum += C[i];
	else
		for (i = 0; i &lt; k; ++i)
			sum += C[i], B[i] = sum - C[i];
}

/* sort all type LMS suffixes */
inline void LMSsort1(sais_index_type T[], sais_index_type SA[], sais_index_type C[], sais_index_type B[], sais_index_type n, sais_index_type k)
{
	sais_index_type *b, i, j;
	sais_index_type c0, c1;
	
	/* compute SAl */
	if (C == B)
		getCounts(T, C, n, k);
	getBuckets(C, B, k, 0); /* find starts of buckets */
	j = n - 1;
	b = SA + B[c1 = T[j]];
	--j;
	*b++ = (T[j] &lt; c1) ? ~j : j;
	for (i = 0; i &lt; n; ++i)
	{
		if (0 &lt; (j = SA[i]))
		{
			if ((c0 = T[j]) != c1)
				B[c1] = b - SA, b = SA + B[c1 = c0];
			--j;
			*b++ = (T[j] &lt; c1) ? ~j : j;
			SA[i] = 0;
		}
		elsif (j &lt; 0)
			SA[i] = ~j;
	}
	/* compute SAs */
	if (C == B)
		getCounts(T, C, n, k);
	getBuckets(C, B, k, 1); /* find ends of buckets */
	for (i = n - 1, b = SA + B[c1 = 0]; 0 &lt;= i; --i)
		if (0 &lt; (j = SA[i]))
		{
			if ((c0 = T[j]) != c1)
				B[c1] = b - SA, b = SA + B[c1 = c0];
			--j;
			*--b = (T[j] &gt; c1) ? ~(j + 1) : j;
			SA[i] = 0;
		}
}

inline sais_index_type LMSpostproc1(sais_index_type T[], sais_index_type SA[], sais_index_type n, sais_index_type m)
{
	sais_index_type i, j, p, q, plen, qlen, name;
	sais_index_type c0, c1;
	sais_bool_type diff;
	
	/* compact all the sorted substrings into the first m items of SA
	2*m must be not larger than n (proveable) */
	for (i = 0; (p = SA[i]) &lt; 0; ++i)
		SA[i] = ~p;
	if (i &lt; m)
		for (j = i, ++i; ; ++i)
			if ((p = SA[i]) &lt; 0)
			{
				SA[j++] = ~p, SA[i] = 0;
				if (j == m)
					break;
			}
	
	/* store the length of all substrings */
	i = n - 1; j = n - 1; c0 = T[n - 1];
	do
		c1 = c0;
	while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &gt;= c1));
	for (; 0 &lt;= i; )
	{
		do
			c1 = c0;
		while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &lt;= c1));
		if (0 &lt;= i)
		{
			SA[m + ((i + 1) &gt;&gt; 1)] = j - i; j = i + 1;
			do
				c1 = c0;
			while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &gt;= c1));
		}
	}
	
	/* find the lexicographic names of all substrings */
	for (i = 0, name = 0, q = n, qlen = 0; i &lt; m; ++i)
	{
		p = SA[i], plen = SA[m + (p &gt;&gt; 1)], diff = 1;
		if ((plen == qlen) &amp;&amp; ((q + plen) &lt; n))
		{
			for (j = 0; (j &lt; plen) &amp;&amp; (T[p + j] == T[q + j]); ++j)
				;
			if (j == plen)
				diff = 0;
		}
		if (diff)
			++name, q = p, qlen = plen;
		SA[m + (p &gt;&gt; 1)] = name;
	}
	
	return name;
}

inline void LMSsort2(sais_index_type T[], sais_index_type SA[], sais_index_type C[], sais_index_type B[], sais_index_type D[], sais_index_type n, sais_index_type k)
{
	sais_index_type *b, i, j, t, d;
	sais_index_type c0, c1;
	
	/* compute SAl */
	getBuckets(C, B, k, 0); /* find starts of buckets */
	j = n - 1;
	b = SA + B[c1 = T[j]];
	--j;
	t = (T[j] &lt; c1);
	j += n;
	*b++ = (t &amp; 1) ? ~j : j;
	for (i = 0, d = 0; i &lt; n; ++i)
	{
		if (0 &lt; (j = SA[i]))
		{
			if (n &lt;= j)
				++d, j -= n;
			if ((c0 = T[j]) != c1)
				B[c1] = b - SA, b = SA + B[c1 = c0];
			--j;
			t = c0; t = (t &lt;&lt; 1) | (T[j] &lt; c1);
			if (D[t] != d)
				j += n, D[t] = d;
			*b++ = (t &amp; 1) ? ~j : j;
			SA[i] = 0;
		}
		elsif (j &lt; 0)
			SA[i] = ~j;
	}
	for (i = n - 1; 0 &lt;= i; --i)
		if (0 &lt; SA[i] &amp;&amp; SA[i] &lt; n)
		{
			SA[i] += n;
			for (j = i - 1; SA[j] &lt; n; --j)
				;
			SA[j] -= n;
			i = j;
		}
	
	/* compute SAs */
	getBuckets(C, B, k, 1); /* find ends of buckets */
	for (i = n - 1, d += 1, b = SA + B[c1 = 0]; 0 &lt;= i; --i)
		if (0 &lt; (j = SA[i]))
		{
			if (n &lt;= j)
				++d, j -= n;
			if ((c0 = T[j]) != c1)
				B[c1] = b - SA, b = SA + B[c1 = c0];
			--j;
			t = c0; t = (t &lt;&lt; 1) | (T[j] &gt; c1);
			if (D[t] != d)
				j += n, D[t] = d;
			*--b = (t &amp; 1) ? ~(j + 1) : j;
			SA[i] = 0;
		}
}

inline sais_index_type LMSpostproc2(sais_index_type SA[], sais_index_type n, sais_index_type m)
{
	sais_index_type i, j, d, name;
	
	/* compact all the sorted LMS substrings into the first m items of SA */
	for (i = 0, name = 0; (j = SA[i]) &lt; 0; ++i)
	{
		j = ~j;
		if (n &lt;= j)
			++name;
		SA[i] = j;
	}
	if (i &lt; m)
		for (d = i, ++i; ; ++i)
			if ((j = SA[i]) &lt; 0)
			{
				j = ~j;
				if (n &lt;= j)
					++name;
				SA[d++] = j;
				SA[i] = 0;
				if (d == m)
					break;
			}
	if (name &lt; m)
		/* store the lexicographic names */
		for (i = m - 1, d = name + 1; 0 &lt;= i; --i)
		{
			if (n &lt;= (j = SA[i]))
				j -= n, --d;
			SA[m + (j &gt;&gt; 1)] = d;
		}
	else
		/* unset flags */
		for (i = 0; i &lt; m; ++i)
			if (n &lt;= (j = SA[i]))
				j -= n, SA[i] = j;
	
	return name;
}

/* compute SA and BWT */
inline void induceSA(sais_index_type T[], sais_index_type SA[], sais_index_type C[], sais_index_type B[], sais_index_type n, sais_index_type k)
{
	sais_index_type *b, i, j;
	sais_index_type c0, c1;
	/* compute SAl */
	if (C == B)
		getCounts(T, C, n, k);
	getBuckets(C, B, k, 0); /* find starts of buckets */
	j = n - 1;
	b = SA + B[c1 = T[j]];
	*b++ = ((0 &lt; j) &amp;&amp; (T[j - 1] &lt; c1)) ? ~j : j;
	for (i = 0; i &lt; n; ++i)
	{
		j = SA[i], SA[i] = ~j;
		if (0 &lt; j)
		{
			--j;
			if ((c0 = T[j]) != c1)
				B[c1] = b - SA, b = SA + B[c1 = c0];
			*b++ = ((0 &lt; j) &amp;&amp; (T[j - 1] &lt; c1)) ? ~j : j;
		}
	}
	/* compute SAs */
	if (C == B)
		getCounts(T, C, n, k);
	getBuckets(C, B, k, 1); /* find ends of buckets */
	for (i = n - 1, b = SA + B[c1 = 0]; 0 &lt;= i; --i)
		if (0 &lt; (j = SA[i]))
		{
			--j;
			if ((c0 = T[j]) != c1)
				B[c1] = b - SA, b = SA + B[c1 = c0];
			*--b = ((j == 0) || (T[j - 1] &gt; c1)) ? ~j : j;
		}
		else
			SA[i] = ~j;
}

/* find the suffix array SA of T[0..n-1] in {0..255}^n */
sais_index_type sais_main(sais_index_type T[], sais_index_type SA[], sais_index_type fs, sais_index_type n, sais_index_type k)
{
	sais_index_type *C, *B, *D, *RA, *b;
	sais_index_type i, j, m, p, q, t, name, pidx = 0, newfs;
	sais_index_type c0, c1;
	unsigned int flags;
	
	if (k &lt;= MINBUCKETSIZE)
	{
		C = sais_malloc(k, sais_index_type);
		if (k &lt;= fs)
			B = SA + (n + fs - k), flags = 1;
		else
			B = sais_malloc(k, sais_index_type), flags = 3;
	}
	else
		if (k &lt;= fs)
		{
			C = SA + (n + fs - k);
			if (k &lt;= (fs - k))
				B = C - k, flags = 0;
			elsif (k &lt;= (MINBUCKETSIZE * 4))
				B = sais_malloc(k, sais_index_type), flags = 2;
			else
				B = C, flags = 8;
		}
		else
			C = B = sais_malloc(k, sais_index_type), flags = 4 | 8;
	if ((n &lt;= SAIS_LMSSORT2_LIMIT) &amp;&amp; (2 &lt;= (n / k)))
	{
		if (flags &amp; 1)
			flags |= ((k * 2) &lt;= (fs - k)) ? 32 : 16;
		elsif ((flags == 0) &amp;&amp; ((k * 2) &lt;= (fs - k * 2)))
			flags |= 32;
	}
	
	/* stage 1: reduce the problem by at least 1/2
	sort all the LMS-substrings */
	getCounts(T, C, n, k), getBuckets(C, B, k, 1); /* find ends of buckets */
	for (i = 0; i &lt; n; ++i)
		SA[i] = 0;
	b = &amp;t, i = n - 1, j = n, m = 0, c0 = T[n - 1];
	do
		c1 = c0;
	while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &gt;= c1));
	for (; 0 &lt;= i; )
	{
		do
			c1 = c0;
		while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &lt;= c1));
		if (0 &lt;= i)
		{
			*b = j; b = SA + --B[c1]; j = i; ++m;
			do
				c1 = c0;
			while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &gt;= c1));
		}
	}
	
	if (1 &lt; m)
	{
		if (flags &amp; (16 | 32))
		{
			if (flags &amp; 16)
				D = sais_malloc(k * 2, sais_index_type);
			else
				D = B - k * 2;
			++B[T[j + 1]];
			for (i = 0, j = 0; i &lt; k; ++i)
			{
				j += C[i];
				if (B[i] != j)
					SA[B[i]] += n;
				D[i] = D[i + k] = 0;
			}
			LMSsort2(T, SA, C, B, D, n, k);
			name = LMSpostproc2(SA, n, m);
		}
		else
		{
			LMSsort1(T, SA, C, B, n, k);
			name = LMSpostproc1(T, SA, n, m);
		}
	}
	elsif (m == 1)
		*b = j + 1, name = 1;
	else
		name = 0;
	
	/* stage 2: solve the reduced problem
	recurse if names are not yet unique */
	if (name &lt; m)
	{
		newfs = (n + fs) - (m * 2);
		if ((flags &amp; (1 | 4 | 8)) == 0)
		{
			if ((k + name) &lt;= newfs)
				newfs -= k;
			else
				flags |= 8;
		}
		RA = SA + m + newfs;
		for (i = m + (n &gt;&gt; 1) - 1, j = m - 1; m &lt;= i; --i)
			if (SA[i] != 0)
				RA[j--] = SA[i] - 1;
		sais_main(RA, SA, newfs, m, name);
		
		i = n - 1; j = m - 1; c0 = T[n - 1];
		do
			c1 = c0;
		while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &gt;= c1));
		for (; 0 &lt;= i; )
		{
			do
				c1 = c0;
			while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &lt;= c1));
			if (0 &lt;= i)
			{
				RA[j--] = i + 1;
				do
					c1 = c0;
				while ((0 &lt;= --i) &amp;&amp; ((c0 = T[i]) &gt;= c1));
			}
		}
		for (i = 0; i &lt; m; ++i)
			SA[i] = RA[SA[i]];
		if (flags &amp; 4)
			C = B = sais_malloc(k, int);
		if (flags &amp; 2)
			B = sais_malloc(k, int);
	}
	
	/* stage 3: induce the result for  the original problem */
	if (flags &amp; 8)
		getCounts(T, C, n, k);
	/* put all left-most S characters into their buckets */
	if (1 &lt; m)
	{
		getBuckets(C, B, k, 1); /* find ends of buckets */
		i = m - 1, j = n, p = SA[m - 1], c1 = T[p];
		do
		{
			q = B[c0 = c1];
			while (q &lt; j)
				SA[--j] = 0;
			do
			{
				SA[--j] = p;
				if (--i &lt; 0)
					break;
				p = SA[i];
			}
			while ((c1 = T[p]) == c0);
		}
		while (0 &lt;= i);
		while (0 &lt; j)
			SA[--j] = 0;
	}
	induceSA(T, SA, C, B, n, k);
	
	return pidx;
}

/*---------------------------------------------------------------------------*/

inline int sais(int T[], int SA[], int n)
{
	return sais_main(T, SA, 0, n, 128);
}

/*****************************************************************************/

#include &lt;stdio.h&gt;
#include &lt;string.h&gt;

#define _O_Buffer_Size (1 &lt;&lt; 24)
char _O_Buffer[_O_Buffer_Size];
char* _O_pos = _O_Buffer;

inline void putint(int x)
{
	char _buf[10];
	char* _pos = _buf;
	do
		*_pos++ = x % 10 | &#x27;0&#x27;;
	while (x /= 10);
	while (_pos != _buf)
		*_O_pos++ = *--_pos;
}

/*---------------------------------------------------------------------------*/

#define Size 100005

int length;
char buf[Size];
int S[Size];
int SA[Size];
int Rank[Size];
int LCP[Size];

int main(int argc, char** argv)
{
	fread(buf, 1, Size, stdin);
	for (length = 0; &#x27;a&#x27; &lt;= buf[length] &amp;&amp; buf[length] &lt;= &#x27;z&#x27;; ++length)
		S[length] = buf[length];
	
	sais(S, SA,length + 1);
	
	int i, j;
	for (i = 1; i &lt;= length; ++i)
		putint(SA[i] + 1), *_O_pos++ = &#x27; &#x27;;
	*_O_pos++ = &#x27;\n&#x27;;
	
	for (i = 0; i &lt;= length; ++i)
		Rank[SA[i]] = i;
	
	for (i = j = 0; i &lt;= length; ++i)
		if (Rank[i])
		{
			while (S[SA[Rank[i]] + j] == S[SA[Rank[i] - 1] + j])
				++j;
			LCP[Rank[i]] = j;
			if (j)
				--j; 
		}
	
	for (i = 2; i &lt;= length; ++i)
		putint(LCP[i]), *_O_pos++ = &#x27; &#x27;;
	
	fwrite(_O_Buffer, 1, _O_pos - _O_Buffer, stdout);
	
	return 0;
}</code></pre>
				<br />
				
				<label for="result"> 评测结果 </label><div class="row"><div class="col-xs-12"><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Compilation</b></td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">Compile OK</td><td class="col-xs-2" style="vertical-align:middle">Score: N/A</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_1" aria-expanded="false" aria-controls="detail_1">显示更多</a></td></tr></table></div><div class="collapse" id="detail_1"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>Compiling...
Compile success!
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #1</b></td><td class="col-xs-2" style="vertical-align:middle">5.64 us</td><td class="col-xs-2" style="vertical-align:middle">56 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 100</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_2" aria-expanded="false" aria-controls="detail_2">显示更多</a></td></tr></table></div><div class="collapse" id="detail_2"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.005640
mem_kb = 56
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #2</b></td><td class="col-xs-2" style="vertical-align:middle">5.9 us</td><td class="col-xs-2" style="vertical-align:middle">56 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_12" aria-expanded="false" aria-controls="detail_12">显示更多</a>
<a class="d0d151b546574f8ea35101544c4fd65e" href="http://www.iis7.com" target="_blank" style="display:inline-block;background-color:;color:#fff;padding:2px 5px;font-family:arial;font-size:12px;font-weight:bold;">iis7站长之家</a></td></tr></table></div><div class="collapse" id="detail_3"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.005903
mem_kb = 56
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #3</b></td><td class="col-xs-2" style="vertical-align:middle">5.34 us</td><td class="col-xs-2" style="vertical-align:middle">56 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_4" aria-expanded="false" aria-controls="detail_4">显示更多</a></td></tr></table></div><div class="collapse" id="detail_4"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.005344
mem_kb = 56
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #4</b></td><td class="col-xs-2" style="vertical-align:middle">7.89 us</td><td class="col-xs-2" style="vertical-align:middle">56 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_5" aria-expanded="false" aria-controls="detail_5">显示更多</a></td></tr></table></div><div class="collapse" id="detail_5"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.007892
mem_kb = 56
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #5</b></td><td class="col-xs-2" style="vertical-align:middle">7.39 us</td><td class="col-xs-2" style="vertical-align:middle">56 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_6" aria-expanded="false" aria-controls="detail_6">显示更多</a></td></tr></table></div><div class="collapse" id="detail_6"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.007391
mem_kb = 56
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #6</b></td><td class="col-xs-2" style="vertical-align:middle">8.13 us</td><td class="col-xs-2" style="vertical-align:middle">56 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_7" aria-expanded="false" aria-controls="detail_7">显示更多</a></td></tr></table></div><div class="collapse" id="detail_7"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.008135
mem_kb = 56
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #7</b></td><td class="col-xs-2" style="vertical-align:middle">9.347 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 168 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_8" aria-expanded="false" aria-controls="detail_8">显示更多</a></td></tr></table></div><div class="collapse" id="detail_8"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 9.346897
mem_kb = 3240
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #8</b></td><td class="col-xs-2" style="vertical-align:middle">10.228 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 540 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_9" aria-expanded="false" aria-controls="detail_9">显示更多</a></td></tr></table></div><div class="collapse" id="detail_9"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 10.227600
mem_kb = 3612
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #9</b></td><td class="col-xs-2" style="vertical-align:middle">10.539 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 268 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_10" aria-expanded="false" aria-controls="detail_10">显示更多</a></td></tr></table></div><div class="collapse" id="detail_10"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 10.539058
mem_kb = 3340
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #10</b></td><td class="col-xs-2" style="vertical-align:middle">6.836 ms</td><td class="col-xs-2" style="vertical-align:middle">2 MB + 148 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_11" aria-expanded="false" aria-controls="detail_11">显示更多</a></td></tr></table></div><div class="collapse" id="detail_11"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 6.836216
mem_kb = 2196
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #11</b></td><td class="col-xs-2" style="vertical-align:middle">6.286 ms</td><td class="col-xs-2" style="vertical-align:middle">2 MB + 224 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_12" aria-expanded="false" aria-controls="detail_12">显示更多</a></td></tr></table></div><div class="collapse" id="detail_12"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 6.285936
mem_kb = 2272
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #12</b></td><td class="col-xs-2" style="vertical-align:middle">4.784 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 928 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_13" aria-expanded="false" aria-controls="detail_13">显示更多</a></td></tr></table></div><div class="collapse" id="detail_13"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 4.783794
mem_kb = 4000
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #13</b></td><td class="col-xs-2" style="vertical-align:middle">5.076 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 864 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_14" aria-expanded="false" aria-controls="detail_14">显示更多</a></td></tr></table></div><div class="collapse" id="detail_14"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 5.076278
mem_kb = 3936
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #14</b></td><td class="col-xs-2" style="vertical-align:middle">6.518 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 324 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_15" aria-expanded="false" aria-controls="detail_15">显示更多</a></td></tr></table></div><div class="collapse" id="detail_15"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 6.518342
mem_kb = 3396
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #15</b></td><td class="col-xs-2" style="vertical-align:middle">6.534 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 360 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_16" aria-expanded="false" aria-controls="detail_16">显示更多</a></td></tr></table></div><div class="collapse" id="detail_16"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 6.533778
mem_kb = 3432
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #16</b></td><td class="col-xs-2" style="vertical-align:middle">5.806 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 928 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_17" aria-expanded="false" aria-controls="detail_17">显示更多</a></td></tr></table></div><div class="collapse" id="detail_17"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 5.805897
mem_kb = 4000
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #17</b></td><td class="col-xs-2" style="vertical-align:middle">6.157 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 928 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_18" aria-expanded="false" aria-controls="detail_18">显示更多</a></td></tr></table></div><div class="collapse" id="detail_18"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 6.156884
mem_kb = 4000
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Subtask #1 Testcase #18</b></td><td class="col-xs-2" style="vertical-align:middle">6.16 ms</td><td class="col-xs-2" style="vertical-align:middle">3 MB + 928 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 0</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_19" aria-expanded="false" aria-controls="detail_19">显示更多</a></td></tr></table></div><div class="collapse" id="detail_19"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 6.160185
mem_kb = 4000
Correct Answer
</textarea></div></div></div></div>
			</div>
		</div>
	</div>

	<hr />
	
	<div class="row">
		<p style="text-align: center; color: #888">
			Judge Duck Online | 评测鸭在线 <br />
			Server Time: 2019-08-02 17:12:38 | Loaded in 8 ms | <a href="/status/index.html"> Server Status </a> <br />
			个人娱乐项目，仅供学习交流使用
		</p>
	</div>
</div>

</body>

</html>
